Kakeya Sets, New Mergers, and Old Extractors
نویسندگان
چکیده
منابع مشابه
Kakeya sets of curves
In this paper we investigate an analogue for curves of the famous Kakeya conjecture about straight lines. The simplest version of the latter asks whether a set in R that includes a unit line segment in every direction must necessarily have dimension n. The analogue we have in mind replaces the line segments by curved arcs from a specified family. (This is a quite different problem from that con...
متن کاملAlgorithmic information and plane Kakeya sets
We formulate the conditional Kolmogorov complexity of x given y at preci-sion r, where x and y are points in Euclidean spaces and r is a natural number.We demonstrate the utility of this notion in two ways.1. We prove a point-to-set principle that enables one to use the (relativized,constructive) dimension of a single point in a set E in a Euclidean space toestablish a l...
متن کاملA New Bound on Partial Sum-sets and Difference-sets, and Applications to the Kakeya Conjecture
Let A, B, be finite subsets of an abelian group, and let G ⊂ A×B be such that #A,#B,#{a + b : (a, b) ∈ G} ≤ N . We consider the question of estimating the quantity #{a − b : (a, b) ∈ G}. In [2] Bourgain improved the trivial upper bound of N to N 1 13 , and applied this to the Kakeya conjecture. We improve Bourgain’s estimate further to N 1 6 , and conclude that Besicovitch sets in Rn have Hausd...
متن کاملHunter, Cauchy Rabbit, and Optimal Kakeya Sets
A planar set that contains a unit segment in every direction is called a Kakeya set. We relate these sets to a game of pursuit on a cycle Zn. A hunter and a rabbit move on the nodes of Zn without seeing each other. At each step, the hunter moves to a neighbouring vertex or stays in place, while the rabbit is free to jump to any node. Adler et al (2003) provide strategies for hunter and rabbit t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2011
ISSN: 0097-5397,1095-7111
DOI: 10.1137/090748731